Crossover Bias in Genetic Programming

نویسندگان

  • Maarten Keijzer
  • James Foster
چکیده

Path length, or search complexity, is an understudied property of trees in genetic programming. Unlike size and depth measures, path length directly measures the balancedness or skewedness of a tree. Here a close relative to path length, called visitation length, is studied. It is shown that a population undergoing standard crossover will introduce a crossover bias in the visitation length. This bias is due to inserting variable length subtrees at various levels of the tree. The crossover bias takes the form of a covariance between the sizes and levels in the trees that form a population. It is conjectured that the crossover bias directly determines the size distribution of trees in genetic programming. Theorems are presented for the one-generation evolution of visitation length both with and without selection. The connection between path length and visitation length is made explicit.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dimensionality Reduction and Improving the Performance of Automatic Modulation Classification using Genetic Programming (RESEARCH NOTE)

This paper shows how we can make advantage of using genetic programming in selection of suitable features for automatic modulation recognition. Automatic modulation recognition is one of the essential components of modern receivers. In this regard, selection of suitable features may significantly affect the performance of the process. Simulations were conducted with 5db and 10db SNRs. Test and ...

متن کامل

Sub-tree Swapping Crossover, Allele Diffusion and GP Convergence

We provide strong evidence that sub-tree swapping crossover when applied to tree-based representations will cause alleles (node labels) to diffuse within length classes. For a-ary trees we provide further confirmation that all programs are equally likely to be sampled within any length class when sub-tree swapping crossover is applied in the absence of selection and mutation. Therefore, we prop...

متن کامل

Grammar Current Derivation Trees Context - Free S = > Selective Crossover Selective Mutation Directed Mutation Program Fitness Evaluation

The use of bias with automated learning systems has become an important area of research. The use of bias with evolutionary techniques of learning has been shown to have advantages when complex structures are evolved. This is especially true when the semantics of the evolving population of structures is not explicitly represented or analysed during the evolution. This paper describes a framewor...

متن کامل

Grammatically-based Genetic Programming

The genetic programming (GP) paradigm is a functional approach to inductively forming programs. The use of natural selection based on a tness function for reproduction of the program population has allowed many problems to be solved that require a non-xed representation. Attempts to extend GP have focussed on typing the language to restrict crossover and to ensure legal programs are always crea...

متن کامل

The Distributional Biases of Crossover Operators

The choice of genetic operators is one way in which genetic algorithms can be tailored to speciic optimization problems. For bit represented problems, the choice of crossover operator , or the choice not to use a crossover operator, can dramatically aaect search performance. The eecacy of crossover for genetic search is governed by the relationship between the crossover biases and the search pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007